ar X iv : 0 90 6 . 44 31 v 1 [ cs . C C ] 2 4 Ju n 20 09 The Complexity of Probabilistic Lobbying ∗

ar X iv : 0 90 6 . 44 31 v 2 [ cs . C C ] 2 6 Ju n 20 09 The Complexity of Probabilistic Lobbying ∗

We propose various models for lobbying in a probabilistic environment, in which an actor (called “The Lobby”) seeks to influence the voters’ preferences of voting for or against multiple issues when the voters’ preferences are represented in terms of probabilities. In particular, we provide two evaluation criteria and three bribery methods to formally describe these models, and we consider the ...

ar X iv : 0 90 6 . 48 35 v 1 [ m at h . O C ] 2 6 Ju n 20 09 The Complex Gradient Operator and the CR - Calculus

ar X iv : 0 90 6 . 18 57 v 1 [ m at h . C O ] 1 0 Ju n 20 09 On the circumference , connectivity and dominating cycles

Every 4-connected graph with minimum degree δ and connectivity κ either has a cycle of length at least 4δ − 2κ or has a dominating cycle.

ar X iv : 0 90 9 . 44 56 v 1 [ cs . A I ] 2 4 Se p 20 09 The Weighted C FG Constraint

We introduce the weighted CFG constraint and propose a propagation algorithm that enforces domain consistency in O(n|G|) time. We show that this algorithm can be decomposed into a set of primitive arithmetic constraints without hindering propagation.

ar X iv : 0 90 1 . 44 03 v 3 [ m at h . C T ] 2 5 Ju n 20 09 A * - autonomous Category of Banach Spaces – Corrected

We describe a C-linear additive *-autonomous category of Banach spaces. Please note that a correction has been appended to the original version 1 which is maintained here for reference. Also, a proposed example of a *-autonomous category of topological C-linear spaces has been added to version 2.